The index entropy of a mismatched codebook
نویسنده
چکیده
We show that if a random codebook for lossy source coding is generated by a non-optimum reproduction distribution Q, then the entropy of the index of the D-matching codeword is reduced by conditioning on the codebook: the number of bits saved is equal to the divergence between the \favorite type" in the codebook and the generating distribution Q. Speciic examples are provided.
منابع مشابه
Theoretic Shaping Bounds for Single Letter Constraints and Mismatched Decoding
Shaping gain is attained in schemes where a shaped subcode is chosen from a larger codebook by a codeword selection process. This includes the popular method of Trellis Shaping (TS), originally proposed by Forney for average power reduction. The decoding process of such schemes is mismatched, since it is aware of only the large codebook. This study models such schemes by a random code construct...
متن کاملTwo novel lossless algorithms to exploit index redundancy in VQ speech compression
We address the problem of speech compression at very low rates, with the short-term spectrum compressed to less than 20 bits per frame. Current techniques apply structured vector quantization (VQ) to the short-term synthesis filter coefficients to achieve rates of the order of 24 to 26 bits per frame. In this paper we show that temporal correlations in the VQ index stream can be introduced by d...
متن کاملFast LBG codebook generator for BTC image
Conclu.sitm We proposed a simple dynamic index mapping which considerably reduces the index entropy by expoiting interhlock correlation. It was shown that it provides a considerable amount of hit-rate reduction not only in ordinary VQ but also in many hybrid VQ systems. Since the proposed index encoding scheme requires only a small amount of additional computation and does not change the quanti...
متن کاملAn error resilient coding scheme for JPEG image transmission based on data embedding and side-match vector quantization
For an entropy-coded Joint Photographic Experts Group (JPEG) image, a transmission error in a codeword will not only affect the underlying codeword but also may affect subsequent codewords, resulting in a great degradation of the received image. In this study, an error resilient coding scheme for JPEG image transmission based on data embedding and side-match vector quantization (VQ) is proposed...
متن کاملFast codeword search algorithm for ECVQ using hyperplane decision rule
Vector quantization is the process of encoding vector data as an index to a dictionary or codebook of representative vectors. One of the most serious problems for vector quantization is the high computational complexity involved in searching for the closest codeword through the codebook. Entropy-constrained vector quantization (ECVQ) codebook design based on empirical data involves an expensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 48 شماره
صفحات -
تاریخ انتشار 2002